Adding the axioms to Axiom Towards a system of automated reasoning in Aldor

نویسنده

  • Erik Poll
چکیده

A number of combinations of theorem proving and computer algebra systems have been proposed; in this paper we describe another, namely a way to incorporate a logic in the computer algebra system Axiom. We examine the type system of Aldor { the Axiom Library Compiler { and show that with some modiications we can use the dependent types of the system to model a logic, under the Curry-Howard isomorphism. We give a number of example applications of the logic we construct.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On characterizations of the fully rational fuzzy choice functions

In the present paper, we introduce the fuzzy Nehring axiom, fuzzy Sen axiom and weaker form of the weak fuzzycongruence axiom. We establish interrelations between these axioms and their relation with fuzzy Chernoff axiom. Weexpress full rationality of a fuzzy choice function using these axioms along with the fuzzy Chernoff axiom.

متن کامل

The Urysohn, completely Hausdorff and completely regular axioms in $L$-fuzzy topological spaces

In this paper, the Urysohn, completely Hausdorff and completely regular axioms in $L$-topological spaces are generalized to $L$-fuzzy topological spaces. Each $L$-fuzzy topological space can be regarded to be Urysohn, completely Hausdorff and completely regular tosome degree. Some properties of them are investigated. The relations among them and $T_2$ in $L$-fuzzy topological spaces are discussed.

متن کامل

BASES AND CIRCUITS OF FUZZIFYING MATROIDS

In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievableexample is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for thebasis axioms and circuit axioms of crisp matroids respectively, are presented. It is proved that a fuzzifying matroidis equivalent to a mapping which satisfies the basis ...

متن کامل

BASE AXIOMS AND SUBBASE AXIOMS IN M-FUZZIFYING CONVEX SPACES

Based on a completely distributive lattice $M$, base axioms and subbase axioms are introduced in $M$-fuzzifying convex spaces. It is shown that a mapping $mathscr{B}$ (resp. $varphi$) with the base axioms (resp. subbase axioms) can induce a unique $M$-fuzzifying convex structure with  $mathscr{B}$ (resp. $varphi$) as its base (resp. subbase). As applications, it is proved that bases and subbase...

متن کامل

SRASS - A Semantic Relevance Axiom Selection System

This paper describes the design, implementation, and testing of a system for selecting necessary axioms from a large set also containing superfluous axioms, to obtain a proof of a conjecture. The selection is determined by semantics of the axioms and conjecture, ordered heuristically by a syntactic relevance measure. The system is able to solve many problems that cannot be solved alone by the u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998